Counting edge-Kempe-equivalence classes for 3-edge-colored cubic graphs
نویسندگان
چکیده
Two edge colorings of a graph are edge-Kempe equivalent if one can be obtained from the other by a series of edge-Kempe switches. This work gives some results for the number of edge-Kempe equivalence classes for cubic graphs. In particular we show every 2-connected planar bipartite cubic graph has exactly one edge-Kempe equivalence class. Additionally, we exhibit infinite families of nonplanar bipartite cubic graphs with a range of numbers of edge-Kempe equivalence classes. Techniques are developed that will be useful for analyzing other classes of graphs as well.
منابع مشابه
ON THE EDGE COVER POLYNOMIAL OF CERTAIN GRAPHS
Let $G$ be a simple graph of order $n$ and size $m$.The edge covering of $G$ is a set of edges such that every vertex of $G$ is incident to at least one edge of the set. The edge cover polynomial of $G$ is the polynomial$E(G,x)=sum_{i=rho(G)}^{m} e(G,i) x^{i}$,where $e(G,i)$ is the number of edge coverings of $G$ of size $i$, and$rho(G)$ is the edge covering number of $G$. In this paper we stud...
متن کاملSolution of Vizing's Problem on Interchanges for the case of Graphs with Maximum Degree 4 and Related Results
Let G be a Class 1 graph with maximum degree 4 and let t ≥ 5 be an integer. We show that any proper t-edge coloring of G can be transformed to any proper 4-edge coloring of G using only transformations on 2-colored subgraphs (so-called interchanges). This settles the smallest previously unsolved case of a well-known problem of Vizing on interchanges, posed in 1965. Using our result we give an a...
متن کاملOn Edge-Decomposition of Cubic Graphs into Copies of the Double-Star with Four Edges
A tree containing exactly two non-pendant vertices is called a double-star. Let $k_1$ and $k_2$ be two positive integers. The double-star with degree sequence $(k_1+1, k_2+1, 1, ldots, 1)$ is denoted by $S_{k_1, k_2}$. It is known that a cubic graph has an $S_{1,1}$-decomposition if and only if it contains a perfect matching. In this paper, we study the $S_{1,2}$-decomposit...
متن کاملA simple and fast heuristic algorithm for edge-coloring of graphs
A simple but empirically efficient heuristic algorithm for the edge-coloring of graphs is presented. Its basic idea is the displacement of ‘conflicts’ (repeated colors in the edges incident to a vertex) along paths of adjacent vertices whose incident edges are recolored by swapping alternating colors (that is, doing a Kempe interchange). The results of performance tests on random cubic and ∆ -r...
متن کاملDecomposition characterizations of classes of 2-connected graphs
By applying the Tutte decomposition of 2{connected graphs into 3{block trees we provide unique structural characterizations of several classes of 2{connected graphs, including minimally 2{connected graphs, minimally 2{edge{connected graphs, critically 2{connected graphs, critically 2{edge{connected graphs, 3{edge{connected graphs, 2{connected cubic graphs and 3{connected cubic graphs. We also g...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 325 شماره
صفحات -
تاریخ انتشار 2014